Save from: cs. Logic design 1 st Class أستاذ المادة: د. عماد
|
|
- Dina Robertson
- 5 years ago
- Views:
Transcription
1 Save from: cs Logic design 1 st Class أستاذ المادة: د. عماد استاذة المادة: م.م ميساء
2 Contents Lectured One: Number system operation 1- Decimal numbers. 2- Binary numbers. 3- Octal numbers. 4- Hexadecimal numbers. Lectured Two: Binary arithmetic 1- Binary Addition. 2- Binary Subtraction. 3-1's and 2's Complement of Binary Number. 4- Hexadecimal Addition &Subtraction. 5- Octal Addition &Subtraction. 6- Gray Code. 7- Access 3 code. Lectured Three: Logic Gats 1- Set of Gats AND, OR, NOT, XOR, NOR, NAND, BUFFER. 2- HALF-ADDER. 3- FULL- ADDER. Lectured Four: Boolean Algebra &Logic Simplification 1- Rules of Boolean algebra. 2- Examples 3- Demorgan's theorems. 4- Example. 5- Sun of Product (SOP). 6- Product of Sum (POS). Lectured Five: Karnaugh map 1- Three variable karnaugh map. 2- Four variable karnaugh map. ٢
3 Lectured Six: Combinational Logic 1- The NAND Gate as a Universal Logic Element. 2- The NOR Gate as a Universal Logic Element. 3- Bit Parallel Adder. 4- Example. Lectured Seven: 1- Decoders. 2-Encoders. 3- Multiplexer. Lectured Eight: Flip-Flop 1- SR Flip-Flops. 2- D Flip-Flops. 3- JK Flip-Flops. References 1- Computer System Architecture Third Edition M. Morris Mano 2- Digital Fundamentals Eight Edition FLOYD ٣
4 Lectured One 1- Number Systems Operation: 1- Decimal Numbers. 2- Binary Numbers. 3- Octal Numbers. 4- Hexadecimal Numbers. 1- Decimal Numbers: In the decimal number system each of the ten digits (10digits), 0 through 9 (0, 1, 2, 3, 4, 5, 6, 7, 8, and 9). Decimal weight Example (1): (345) =10 2 * * *5=345= (345) Example (2): 23.5 = (23.5) 10 2* * *10-1 = =23.5 Where 10 0 =1 2- Binary Numbers: The binary number system its two digits a basetwo system. The two binary digits (bits) are 1 and 0 (1,0). Binary weight Weight value A- Binary to Decimal Conversion: *Binary number where 2 0 = = 2 6 * *1+2 4 *0+2 3 *1+2 2 *1+2 1 *0+2 0 *1 = =96+13=109 (109) 10 ٤
5 *The fractional binary number = 1* *2-2 +1*2-3 +1*2-4 = = (0.6875) 10 B- Decimal to Binary Conversion: 1- Convert a decimal whole number to binary using the repeated division by 2 method. 2- Convert a decimal fraction to binary using the repeated Multiplication by 2 method. Example (1): Number (58) 10 ==== (111010) mod LSB 2 29 == == == 0 ======= (111010) == == 1 0 == 1 MSB Example (2): Number (0.3125) 10 ====== (0101) 2 MSB LSB carry * * * * (0101) 2 ٥
6 3- Octal Numbers: The octal number system is composed of eight digits, which are 0, 1, 2, 3, 4, 5, 6, and 7. To count above 7, begin another column and start over: 10, 11, 12, 13, 14, 15, 16, and , 21, 22, 23, 24, 25, 26, and , 31, 37. A- Octal to Decimal conversion: Weight Octal number 2374 ==== (1276) 10 xample: (2374) 8 = 2*8 3 +3*8 2 +7*8 1 +4*8 0 = 2*512+3*64+7*8+4*1 = = (1276) 10 B- Decimal to Octal Conversion: Example: Decimal number (359) 10 ======= (547) mod LSB 8 44 == == 4 ==== (547) 8 0 == 5 MSB ٦
7 C- Octal to Binary Conversion: Octal digit can be represented by a 3-bit binary number. Octal digit binary Examples: (25) 8 (140) 8 (2 5) 8 (1 4 0) 8 (010101) 2 ( ) 2 D- Binary to Octal Conversion: Conversion binary number to octal number is start with right most group of three bits and moving from right to left. Examples: (110101) 2 ( ) (6 5) 8 (5 7 1) 8 (65) 8 (571) 8 ٧
8 4- Hexadecimal Numbers: The hexadecimal number system has a base of sixteen; it is composed of 16 digits and alphabetic characters. Decimal Binary Hexadecimal A B C D E F ٨
9 A- Binary to Hexadecimal conversion: 4-bit groups, starting at the right-most bit. Example: ( ) 2 ======= (CA57) C A 5 7 B- Hexadecimal to Binary Conversion: Example: (10A4) 16 ========= ( ) A C- Hexadecimal to Decimal Conversion: By to method * First method: Example: (A85) 16 ==== (2693) Convert to binary number. 2- Convert from binary number to decimal number. A = 2 11 * *0+2 9 *1+2 8 *0+2 7 *1+2 6 *0+2 5 *0+2 4 *0+2 3 *0+2 2 *1+2 1 *0+2 0 *1= = =2693= (2693) 10 * Second method: Example: (E5) 16 ======== (229) 10 (E5) 16 =E* *16 0 =14*16+5*1=224+5=229= (229) 10 ٩
10 D- Decimal to Hexadecimal Conversion: Example: Convert the decimal number 650 to hexadecimal by repeated division by 16. (650) 10 ===== (28A) 16 Mod LSD ====== A 16 2 ====== 8 MSD 2 8 A LSD = (28A) 8 0 ====== 2 MSD ١٠
11 Lectured Two 2-Binary Arithmetic: 1- Binary Addition. 2- Binary Subtraction. 3- Binary Multiplication. 4- Binary Division. 1- Binary Addition: The four basic rules for adding binary digits (bits) are as follows. 0+0=0 Sum of 0 with a carry 0 0+1=1 Sum of 1 with a carry 0 1+0=1 Sum of 1 with a carry 0 1+1=1 0 Sum of 0 with a carry 1 Examples: Binary Subtraction: The four basic rules for subtracting are as follows. 0-0=0 1-1=0 1-0=1 0-1=1 0-1 with a borrow of 1 ١١
12 Examples: 's And 2's Complement of Binary Number: The 1's complement and the 2's complement of binary number are important because they permit the representation of negative numbers. Binary Number 'sComplement o 1 0 2's Complement of a binary number is found by adding 1 to the LSB of the 1's Complement. 2's Complement= (1's Complement) +1 Binary number 'scomplement Add 's complement ١٢
13 In decimal number complement such as: 0==== 9 7==== 2 6==== 3 9==== 0 4==== 5 1==== 8 Signed Numbers: Signed binary number consists of both sign and magnitude information. 0 positive numbers The sign bit 1 negative numbers sign bit magnitude bits Example: Express the decimal number - 39 as an 8-bit number in the sign-magnitude, 1's complement, and 2's complement forms. Solution: 1- Write the 8-bit number for 's complement Add 1 1 sign bit negative = - 39 ١٣
14 4- Hexadecimal Addition & Subtraction: Hexadecimal Addition: 2A7 2AB 2B BE 5C2 AF Hexadecimal subtraction: CA2 47C - A1B - 2BE 287 1BE 5- Octal Addition & Subtraction: Binary Coded Decimal (BCD): Binary coded decimal means that each decimal digit, 0 through 9, is represented by a binary code of four bits. The (BCD) Code: The code is a type of (BCD) code. The indicates the binary weights of the four bits (2 3, 2 2, 2 1, 2 0 ). ١٤
15 6 -The Gray Code: Example: Convert binary to Gray Binary ==== Gray ==== Convert Binary to Gray Gray ==== Binary ==== Decimal Binary Gray ١٥
16 7- Excess -3 Code: Addition three to any number in decimal number or binary number such as in table. Decimal BCD Excess -3 Excess -3 Gray ١٦
17 Logic Gats: 1- Set of Gets Lectured Three ١٧
18 2- Half Adder: The basic digital arithmetic circuit is the addition of two binary digits. Input variables of a half-adder call augends & addend bits. The output variables the sum & carry. X Y C S Figure (1-a) Logic diagram for half adder Figure (1-b) Truth table for half adder Half- Adder questions: S=XY+XY S=X (+)Y C=X*Y 3-Full-Adder: A full - adder is a combinational circuit that forms the arithmetic sum of three input bits. It consists of three inputs &two outputs. Figure (2-a) Logic diagram for full adder ١٨
19 X FA s Y c Z Figure (2-b) Block diagram for full adder Inputs Out puts X Y Z C S Figure (2-c) Truth table for full adder Full - Adder questions: S=x (+) y (+) z C=XY+ (XZ (+) YZ) C=X*Y+ (X (+) Y) Z ١٩
20 Lecture Four Boolean Algebra &Logic Simplification: 1-Rules of Boolean algebra: 1- A+0=A 2- A+1=1 3- A*0=0 4- A*1=A 5- A+A=A 6- A+A=1 7- A*A=A 8- A*A=0 9- A=A ====== Demoragan's theorems 10- A+BA=A 11- A+AB=A+B 12- (A+B)(A+C)=A+BC 2- Examples: Example 1: F = X + ý Determine the truth table and logic diagram X Y Z F Truth table Logic diagram ٢٠
21 Example 2: AB+ A (B+C)+ B(B+C) 1- AB+AB+AC+BB+BC 2- AB+AB+AC+B+BC 3- AB+AC+B+BC 4- AB+AC+B 5- B+AC Example 3: F=ABC+ABĆ+ĂC F= AB(C+Ć) +ĂC F= AB+ĂC ٢١
22 Example 4: 3- Demorgan's theorems: Demorgan's theorems ٢٢
23 4- Example: Example 1: a- (A+B)+C = (A+B) C = (A+B)C b- (A+B) +CD = (A+B) CD =(A B) (C+D) = A B (C+D) c- (A+B) C D + E + F = ((A+B) C D) (E+ F) = (A+B+C+D) (E F) = ( A+B+C+D) E F 5- Sum Of Products (SOP): X=AB+BCD+AC Example: a- AB+B(CD+EF)=AB+BCD+BEF b- (A+B)(B+C+D)=AB+AC+AD+BB+BC+BD c- (A+B)+C=(A+B)*C =(A+B)C=AC+BC ٢٣
24 6- Product Of Sum(POS): (A+B)(B+C+D)(A+C) Example: SOP A B X F A B A B Example: POS A B X F A+ B A+ B ٢٤
25 Lectured Five Karnaugh map: 1- Three variable karnaugh map. ٢٥
26 2- Four variable karnaugh map. ٢٦
27 Combinational Logic: Lectured Six 1-The NAND Gate as a Universal Logic Element: Figure (3) NAND Gates ٢٧
28 2-The NOR Gate as a Universal Logic Element: Figure (4) NOR Gates ٢٨
29 3- Bit Parallel Adder: A group of four bits is a nibble. A basic 4-bit parallel adder is implementation with four full adder stages. Figure (5) 4-bit parallel adder Figure (6) Symbol Logic ٢٩
30 4- Example: Draw the 4-bit parallel adder, find the sum and output carry for the addition of the following two 4-bit numbers if the input carry (C n-1 ) is 0: A4A3A2A1=1010 and B4B3B2B1=1011 Solution: For n=1 A1=0, B1=1, C n-1 =0 =1, and C1=0 For n=2 A2=1, B2=1, C n-1 =0 =0, and C2=1 For n=3 A3=0, B3=0, C n-1 =1 =1, and C3=0 For n=4 A4=1, B4=1, C n-1 =0 =0, and C4=1 ٣٠
31 Lectured Seven Decoders & encoders: 1- Decoder: A decoders is combinational circuit that converts binary information form the n coded inputs to a maximum of 2 n unique outputs. That decoders are called n-to-m line decoders where m <=2 n. The logic diagram of a 3-to-8 line decoder is three data inputs,a0,a1,and A2 are decoded into eight out puts, each out puts representing one of the combinations of the three binary input variables. This decoder is a binary to octal conversion. Figure (7) 3-to-8 line decoder ٣١
32 Enable Inputs Outputs E A2 A1 A0 D7 D6 D5 D4 D3 D2 D1 D0 0 X X X Truth table for 3-to-8 line decoder Figure (8) 2-to-4 line decoder ٣٢
33 Enable Inputs Outputs E A1 A0 D0 D1 D2 D X X Truth table for 2-to-4 line decoder 2- Encoder: An encoder is a digit circuit that performs the inverse operation of a decoder. An encoder has 2 n (or less) input lines and n output lines. An encoder is the octal to binary encoder. It has eight inputs, one for each of the octal digits, and three outputs that generate the corresponding binary number. Ao = D1+D3+D5+D7 A1 = D2+D3+D6+D7 A2 = D4+D5+D6+D7 (Implementation in three OR gates) Inputs Outputs D7 D6 D5 D4 D3 D2 D1 D0 A2 A1 A Truth table for octal to binary encoder ٣٣
34 3- Multiplexers: A multiplexer is a combinational circuit that receiver binary information form one of 2 n input data lines and directs it to a single out put line. The selection of a particular input data line for the output is determined by a set of selection inputs. A 2 n - to- 1, A 4-to-1. Multiplexer is called Data Selector. Figure (9) 4-to-1 line multiplexer Inputs Outputs 0 0 Y1 0 1 Y2 1 0 Y3 1 1 Y4 Truth table for 4-to-1 multiplexer ٣٤
35 Lectured Eight Flip-Flop: The storage elements employed in clocked sequential circuits are called flip-flops. A flip-flops is a binary cell capable of storing one bit of information. It has two outputs, one for the normal value and one for the complement value of the bit stored in it. Type of flip-flops: 1- SR flip-flops. 2- D flip-flops. 3- JK flip-flops. 1- SR FLIP-FLOPS: Figure (10) Logic diagram for SR flip-flop ٣٥
36 Inputs Outputs S R Q Q Comments Invalid condition Latch set Latch reset 1 1 N.C N.C No change Truth table for SR flip-flop 2- D FLIP-FLOPS: FIGURE (11) D Flip-flop Inputs Outputs D CLK Q Q Comments Set(stor1) Reset(stor0) Truth table for D flip-flop ٣٦
37 3- J K FLIP-FLOPS: Figure (12) JK Flip-flop Inputs Outputs J K CLK Q Q Comments 0 0 Q0 Q 0 No change Reset Set 1 1 Q 0 Q0 Toggle Truth table for JK flip-flop ٣٧
38 Answer these questions: Q1- Convert the following: 1- (CF8E) 16 to ( ) (1725) 10 to ( ) ( ) 10 to ( ) 2 4- (7526) 8 to ( ) 10 5-(2591) 10) to ( ) (B2F8) 16 to ( ) 10 Q2- Perform the following: 1- (2AB) 16 (317) (101101) 2 (1110) 2 3- (6410) 8 (324) 8 4- (2CF) 16 (FDB) (4732) 8 + (4611) 8 Q3- Express the decimal number -98, -68 as 8-bit number in the sign-magnitude, 1'S and 2'S Complement. Q4- Design Full-Adder circuit. Q5- Design Half-Adder circuit. Q6- Draw the 4-bit parallel adder, find the sum and output carry for the addition of the following two 4-bit numbers if the input carry (C n-1 ) is 0: A4A3A2A1=1011 and B4B3B2B1=0111. Q7- use K- map to minimize the following SOP expression and convert to POS in K- map. F(A,B,C,D)= 2,3,4,5,6,7,9,12,13,14,15 Q8- Design 3-to-8 lines decoders. OR Design Binary-to-Octal line decoder. ٣٨
39 Q9- Design 2- to 4 lines decoders Q10- Design block diagram of quadruple 2-to-1 line multiplexer. Q11- Design SR flip-flop and explain function. Q12- Design D flip-flop and explain function. Q13- Design JK flip-flop and explain function. Q14- Design Octal-to- Binary line encoder. Q15- Difference between SR and JK flip-flop. ٣٩
Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationReg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering
Sp 6 Reg. No. Question Paper Code : 27156 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Second Semester Computer Science and Engineering CS 6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationCs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationSAU1A FUNDAMENTALS OF DIGITAL COMPUTERS
SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS Unit : I - V Unit : I Overview Fundamentals of Computers Characteristics of Computers Computer Language Operating Systems Generation of Computers 2 Definition of
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)
Subject Code: 17333 Model Answer Page 1/ 27 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018
More informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationCHAPTER 7. Exercises 17/ / /2 2 0
CHAPTER 7 Exercises E7. (a) For the whole part, we have: Quotient Remainders 23/2 /2 5 5/2 2 2/2 0 /2 0 Reading the remainders in reverse order, we obtain: 23 0 = 0 2 For the fractional part we have 2
More information( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function
Question Paper Digital Electronics (EE-204-F) MDU Examination May 2015 1. (a) represent (32)10 in (i) BCD 8421 code (ii) Excess-3 code (iii) ASCII code (b) Design half adder using only NAND gates. ( c)
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES
EC 216(R-15) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN
More informationCombinational Logic. Course Instructor Mohammed Abdul kader
Combinational Logic Contents: Combinational and Sequential digital circuits. Design Procedure of combinational circuit. Adders: Half adder and Full adder. Subtractors: Half Subtractor and Full Subtractor.
More informationCOMBINATIONAL LOGIC FUNCTIONS
COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present
More informationFundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
More informationFundamentals of Boolean Algebra
UNIT-II 1 Fundamentals of Boolean Algebra Basic Postulates Postulate 1 (Definition): A Boolean algebra is a closed algebraic system containing a set K of two or more elements and the two operators and
More informationDepartment of Electrical & Electronics EE-333 DIGITAL SYSTEMS
Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100
More informationChapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]
Chapter 4: Combinational Logic Solutions to Problems: [, 5, 9, 2, 9, 23, 3, 33] Problem: 4- Consider the combinational circuit shown in Fig. P4-. (a) Derive the Boolean expressions for T through T 4. Evaluate
More informationWhy digital? Overview. Number Systems. Binary to Decimal conversion
Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not
More informationUNIT II COMBINATIONAL CIRCUITS:
UNIT II COMBINATIONAL CIRCUITS: INTRODUCTION: The digital system consists of two types of circuits, namely (i) (ii) Combinational circuits Sequential circuits Combinational circuit consists of logic gates
More informationLecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
More informationvidyarthiplus.com vidyarthiplus.com vidyarthiplus.com ANNA UNIVERSITY- COMBATORE B.E./ B.TECH. DEGREE EXAMINATION - JUNE 2009. ELECTRICAL & ELECTONICS ENGG. - FOURTH SEMESTER DIGITAL LOGIC CIRCUITS PART-A
More informationS.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques
S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques Time: 3 Hrs.] Prelim Question Paper Solution [Marks : 100 Q.1(a) Attempt any SIX of the following : [12] Q.1(a) (i) Derive AND gate and OR gate
More informationPhiladelphia University Faculty of Engineering
Philadelphia University Faculty of Engineering Marking Scheme Exam Paper BSc CE Logic Circuits (630211) Final Exam First semester ate: 03/02/2019 Section 1 Weighting 40% of the module total Lecturer: Coordinator:
More informationKUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE
Estd-1984 KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE 641 006 QUESTION BANK UNIT I PART A ISO 9001:2000 Certified 1. Convert (100001110.010) 2 to a decimal number. 2. Find the canonical SOP for the function
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationChapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.
Chapter 4 Dr. Panos Nasiopoulos Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. Sequential: In addition, they include storage elements Combinational
More informationNumber System conversions
Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
More informationDigital Logic Appendix A
Digital Logic Appendix A Boolean Algebra Gates Combinatorial Circuits Sequential Circuits 1 Boolean Algebra George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 Describe digital circuitry
More informationSchedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date.
Schedule Date Day Class No. Dec Mon 25 Final Review 2 Dec Tue 3 Dec Wed 26 Final Review Title Chapters HW Due date Lab Due date LAB 8 Exam 4 Dec Thu 5 Dec Fri Recitation HW 6 Dec Sat 7 Dec Sun 8 Dec Mon
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, Second Semester: 2015/2016 Dept. of Computer Engineering Course Title: Logic Circuits Date: 08/06/2016
More informationWORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of
27 WORKBOOK Detailed Eplanations of Try Yourself Questions Electrical Engineering Digital Electronics Number Systems and Codes T : Solution Converting into decimal number system 2 + 3 + 5 + 8 2 + 4 8 +
More informationUnit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4
Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4 4.1.1 Signal... 4 4.1.2 Comparison of Analog and Digital Signal... 7 4.2 Number Systems... 7 4.2.1 Decimal Number System... 7 4.2.2 Binary
More informationBER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO
UN IVERSIT Y O F CA LIFO RNI A AT BERKELEY BER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO SAN TA BARBA RA S AN TA CRUZ De p a r tm en t of Ele ctr i ca l En gin e e rin g a
More informationLogic. Combinational. inputs. outputs. the result. system can
Digital Electronics Combinational Logic Functions Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends
More informationGate-Level Minimization
Gate-Level Minimization Dr. Bassem A. Abdullah Computer and Systems Department Lectures Prepared by Dr.Mona Safar, Edited and Lectured by Dr.Bassem A. Abdullah Outline 1. The Map Method 2. Four-variable
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT I : BOOLEAN ALGEBRA AND LOGIC GATES PART - A (2 MARKS) Number
More information/ M Morris Mano Digital Design Ahmad_911@hotmailcom / / / / wwwuqucscom Binary Systems Introduction - Digital Systems - The Conversion Between Numbering Systems - From Binary To Decimal - Octet To Decimal
More informationECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks
ECE 545 Digital System Design with VHDL Lecture Digital Logic Refresher Part A Combinational Logic Building Blocks Lecture Roadmap Combinational Logic Basic Logic Review Basic Gates De Morgan s Law Combinational
More informationBoolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits Other operations NAND A NAND B = NOT ( A ANDB) = AB NOR A NOR B = NOT ( A ORB) = A + B Truth tables What is the result of the operation
More informationUnit 3 Session - 9 Data-Processing Circuits
Objectives Unit 3 Session - 9 Data-Processing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction
More informationSAMPLE ANSWERS MARKER COPY
Page 1 of 12 School of Computer Science 60-265-01 Computer Architecture and Digital Design Fall 2012 Midterm Examination # 1 Tuesday, October 23, 2012 SAMPLE ANSWERS MARKER COPY Duration of examination:
More informationPART-A. 2. Expand ASCII and BCD ASCII American Standard Code for Information Interchange BCD Binary Coded Decimal
PART-A 1. What is radix? Give the radix for binary, octal, decimal and hexadecimal Radix is the total number of digits used in a particular number system Binary - 2 (0,1) Octal - 8 (0 to 7) Decimal - 10
More informationLecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University
Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Aby K George, ECE Department, Wayne State University Contents The Map method Two variable
More informationAppendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs
Appendix B Review of Digital Logic Baback Izadi Division of Engineering Programs bai@engr.newpaltz.edu Elect. & Comp. Eng. 2 DeMorgan Symbols NAND (A.B) = A +B NOR (A+B) = A.B AND A.B = A.B = (A +B ) OR
More informationChap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization
More informationINSTITUTEOFAERONAUTICALENGINEERING (Autonomous) Dundigal, Hyderabad
INSTITUTEOFAERONAUTICALENGINEERING (Autonomous) Dundigal, Hyderabad - 50004 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Course Name Course Code Class Branch DIGITAL LOGIC DESIGN A040 II B.
More informationBoolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 (piirisuunnittelu) Describe digital circuitry function programming
More informationIT T35 Digital system desigm y - ii /s - iii
UNIT - II Combinational Logic Adders subtractors code converters binary parallel adder decimal adder magnitude comparator encoders decoders multiplexers demultiplexers-binarymultiplier Parity generator
More informationHakim Weatherspoon CS 3410 Computer Science Cornell University
Hakim Weatherspoon CS 3410 Computer Science Cornell University The slides are the product of many rounds of teaching CS 3410 by Professors Weatherspoon, Bala, Bracy, and Sirer. memory inst 32 register
More informationELEN Electronique numérique
ELEN0040 - Electronique numérique Patricia ROUSSEAUX Année académique 2014-2015 CHAPITRE 3 Combinational Logic Circuits ELEN0040 3-4 1 Combinational Functional Blocks 1.1 Rudimentary Functions 1.2 Functions
More informationDigital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.
CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!
More informationDE58/DC58 LOGIC DESIGN DEC 2014
Q.2 a. In a base-5 number system, 3 digit representations is used. Find out (i) Number of distinct quantities that can be represented.(ii) Representation of highest decimal number in base-5. Since, r=5
More informationEEE130 Digital Electronics I Lecture #4
EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean
More informationDigital System Design Combinational Logic. Assoc. Prof. Pradondet Nilagupta
Digital System Design Combinational Logic Assoc. Prof. Pradondet Nilagupta pom@ku.ac.th Acknowledgement This lecture note is modified from Engin112: Digital Design by Prof. Maciej Ciesielski, Prof. Tilman
More informationCHW 261: Logic Design
CHW 26: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed4 http://bu.edu.eg/staff/ahmedshalaby4# Slide Digital Fundamentals Digital Concepts Slide 2 What?
More informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
More informationDesign of Sequential Circuits
Design of Sequential Circuits Seven Steps: Construct a state diagram (showing contents of flip flop and inputs with next state) Assign letter variables to each flip flop and each input and output variable
More informationVidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution
. (a) (i) ( B C 5) H (A 2 B D) H S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution ( B C 5) H (A 2 B D) H = (FFFF 698) H (ii) (2.3) 4 + (22.3) 4 2 2. 3 2. 3 2 3. 2 (2.3)
More informationZ = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table
Lesson Objectives In this lesson, you will learn about What are combinational circuits Design procedure of combinational circuits Examples of combinational circuit design Combinational Circuits Logic circuit
More informationDigital Electronics Circuits 2017
JSS SCIENCE AND TECHNOLOGY UNIVERSITY Digital Electronics Circuits (EC37L) Lab in-charge: Dr. Shankraiah Course outcomes: After the completion of laboratory the student will be able to, 1. Simplify, design
More informationUnit 2 Session - 6 Combinational Logic Circuits
Objectives Unit 2 Session - 6 Combinational Logic Circuits Draw 3- variable and 4- variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the Product-of-Sums
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Digital IC packages TTL (transistor-transistor
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationENGG 1203 Tutorial - 2 Recall Lab 2 - e.g. 4 input XOR. Parity checking (for interest) Recall : Simplification methods. Recall : Time Delay
ENGG 23 Tutorial - 2 Recall Lab 2 - e.g. 4 input XOR Parity checking (for interest) Parity bit Parity checking Error detection, eg. Data can be Corrupted Even parity total number of s is even Odd parity
More informationPG - TRB UNIT-X- DIGITAL ELECTRONICS. POLYTECHNIC-TRB MATERIALS
SRIMAAN COACHING CENTRE-PG-TRB-PHYSICS- DIGITAL ELECTRONICS-STUDY MATERIAL-CONTACT: 8072230063 SRIMAAN PG - TRB PHYSICS UNIT-X- DIGITAL ELECTRONICS POLYTECHNIC-TRB MATERIALS MATHS/COMPUTER SCIENCE/IT/ECE/EEE
More informationB.Sc. PHYSICS III YEAR
B.Sc. PHYSICS III YEAR DJK3C : DIGITAL ELECTRONICS SYLLABUS Unit I : Number System Decimal binary octal hexadecimal number system conversion from one system to another binary arithmetic 1 s complement
More informationDIGITAL LOGIC CIRCUITS
DIGITAL LOGIC CIRCUITS Digital logic circuits BINARY NUMBER SYSTEM electronic circuits that handle information encoded in binary form (deal with signals that have only two values, and ) Digital. computers,
More informationSynchronous Sequential Logic
1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Midterm02 Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Thursday Nov. 16 th In normal lecture (13:00-14:15)
More informationWeek No. 06: Numbering Systems
Week No. 06: Numbering Systems Numbering System: A numbering system defined as A set of values used to represent quantity. OR A number system is a term used for a set of different symbols or digits, which
More informationS.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques
S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques Time: 3 Hrs.] Prelim Question Paper Solution [Marks : 100 Q.1(a) Attempt any SIX of the following : [12]
More informationDIGITAL LOGIC CIRCUITS
DIGITAL LOGIC CIRCUITS Introduction Logic Gates Boolean Algebra Map Specification Combinational Circuits Flip-Flops Sequential Circuits Memory Components Integrated Circuits Digital Computers 2 LOGIC GATES
More informationPAST EXAM PAPER & MEMO N3 ABOUT THE QUESTION PAPERS:
EKURHULENI TECH COLLEGE. No. 3 Mogale Square, Krugersdorp. Website: www. ekurhulenitech.co.za Email: info@ekurhulenitech.co.za TEL: 011 040 7343 CELL: 073 770 3028/060 715 4529 PAST EXAM PAPER & MEMO N3
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationNumbers and Arithmetic
Numbers and Arithmetic See: P&H Chapter 2.4 2.6, 3.2, C.5 C.6 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register file alu
More informationDept. of ECE, CIT, Gubbi Page 1
Verification: 1) A.B = A + B 7404 7404 7404 A B A.B A.B 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 A B A B A + B 0 0 1 1 1 0 1 1 0 1 1 0 0 1 1 1 1 0 0 0 2) A+B = A. B 7404 7404 7404 A B A+B A+B 0 0 0 1 0 1 1 0 1
More informationWritten exam for IE1204/5 Digital Design with solutions Thursday 29/
Written exam for IE4/5 Digital Design with solutions Thursday 9/ 5 9.-. General Information Examiner: Ingo Sander. Teacher: William Sandqvist phone 8-794487 Exam text does not have to be returned when
More informationCSC9R6 Computer Design. Practical Digital Logic
CSC9R6 Computer Design Practical Digital Logic 1 References (for this part of CSC9R6) Hamacher et al: Computer Organization App A. In library Floyd: Digital Fundamentals Ch 1, 3-6, 8-10 web page: www.prenhall.com/floyd/
More informationLecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions
EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The
More informationBinary logic consists of binary variables and logical operations. The variables are
1) Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated by the alphabets such as A, B, C, x, y, z, etc., with each variable having only two
More informationSIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER
SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU 534 007 DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING DIGITAL
More informationDigital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
More informationCombinational Logic. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C.
Combinational Logic ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Combinational Circuits
More informationUNIT 4 MINTERM AND MAXTERM EXPANSIONS
UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and
More informationXI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.
2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two
More informationUNIT 1. BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS
UNIT 1. BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS Numerical Presentation: In science, technology, business, and, in fact, most other fields of endeavour, we are constantly dealing with quantities. Quantities
More information3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value
EGC22 Digital Logic Fundamental Additional Practice Problems. Complete the following table of equivalent values. Binary. Octal 35.77 33.23.875 29.99 27 9 64 Hexadecimal B.3 D.FD B.4C 2. Calculate the following
More informationComputer Science Final Examination Friday December 14 th 2001
Computer Science 03 60 265 Final Examination Friday December 14 th 2001 Dr. Robert D. Kent and Dr. Alioune Ngom Last Name: First Name: Student Number: INSTRUCTIONS EXAM DURATION IS 3 HOURs. CALCULATORS,
More informationA B D 1 Y D 2 D 3. Truth table for 4 to 1 MUX: A B Y 0 0 D D D D 3
. What is a multiplexer? esign a 4 to multiplexer using logic gates. Write the truth table and explain its working principle. Answer: is a circuit with many inputs but only one output. esigning of 4 to
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part
More informationReview for Test 1 : Ch1 5
Review for Test 1 : Ch1 5 October 5, 2006 Typeset by FoilTEX Positional Numbers 527.46 10 = (5 10 2 )+(2 10 1 )+(7 10 0 )+(4 10 1 )+(6 10 2 ) 527.46 8 = (5 8 2 ) + (2 8 1 ) + (7 8 0 ) + (4 8 1 ) + (6 8
More informationCarry Look Ahead Adders
Carry Look Ahead Adders Lesson Objectives: The objectives of this lesson are to learn about: 1. Carry Look Ahead Adder circuit. 2. Binary Parallel Adder/Subtractor circuit. 3. BCD adder circuit. 4. Binary
More informationCombinational Logic. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C.
Combinational Logic ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2010 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Combinational Circuits
More information